Efficient randomized algorithms for some geometric optimization problems
نویسندگان
چکیده
منابع مشابه
Randomized Algorithms for Geometric Optimization Problems
This chapter reviews randomization algorithms developed in the last few years to solve a wide range of geometric optimization problems. We review a number of general techniques, including randomized binary search, randomized linear-programming algorithms, and random sampling. Next, we describe several applications of these techniques, including facility location, proximity problems, nearest nei...
متن کاملSome Scaleable Parallel Algorithms for Geometric Problems
This paper considers a variety of geometric problems on input sets of size n using a coarse grained multicomputer model consisting of p processors with (np ) local memory each (i.e., ( n p ) memory cells of (logn) bits apiece), where the processors are connected to an arbitrary interconnection network. It introduces e cient scaleable parallel algorithms for a number of geometric problems includ...
متن کاملApproximation Algorithms for Geometric Optimization Problems
This thesis deals with a number of geometric optimization problems which are all NP-hard. The first problem we consider is the set cover problem for polytopes in R3. Here, we are given a set of points in R3 and a fixed set of translates of an arbitrary polytope. We would like to select a subset of the given polytopes such that each input point is covered by at least one polytope and the number ...
متن کاملEfficient Algorithms for Geometric Graph Search Problems
In this paper, we show that many graph search problems can be solved quite efficiently for a geometric intersection graph ofhorizontal and vertical line segments. We first extract several basic operations for depth first search and breadth first search on a graph. Then we present data structures for the intersection graph in terms of which those operations can be implemented in an efficient man...
متن کاملAlgorithms for some graph theoretical optimization problems
This thesis is situated in the field of combinatorial optimization. More specifically, we focus on solution methods for solving a number of graphtheoretical optimization problems. First we give a short introduction to the field of integer programming and state of the art solution techniques. The remainder of this thesis can be roughly split into two parts. The first part is dedicated to the pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 1996
ISSN: 0179-5376,1432-0444
DOI: 10.1007/bf02712871